Design of In-Memory Parallel-Prefix Adders
نویسندگان
چکیده
Computational methods in memory array are being researched many emerging technologies to conquer the ‘von Neumann bottleneck’. Resistive RAM (ReRAM) is a non-volatile memory, which supports Boolean logic operation, and adders can be implemented as sequence of operations memory. While in-memory have recently been proposed, their latency exorbitant for increasing bit-width (O(n)). Decades research computer arithmetic proven parallel-prefix technique fastest addition conventional CMOS-based binary adders. This work endeavors move significantly minimize addition. Majority was chosen fundamental primitive synthesized majority were mapped using proposed algorithm. The algorithm used map any adder mapping performed such way that minimized. enables O(log(n)) array.
منابع مشابه
Design of High Speed 128 bit Parallel Prefix Adders
In this paper, we propose 128-bit Kogge-Stone, Ladner-Fischer, Spanning tree parallel prefix adders and compared with Ripple carry adder. In general N-bit adders like Ripple Carry Adders (slow adders compare to other adders), and Carry Look Ahead adders (area consuming adders) are used in earlier days. But now the most Industries are using parallel prefix adders because of their advantages comp...
متن کاملDesign of High-Speed Low-Power Parallel-Prefix VLSI Adders
Parallel-prefix adders offer a highly-efficient solution to the binary addition problem. Several parallel-prefix adder topologies have been presented that exhibit various area and delay characteristics. However, no methodology has been reported so far that directly aims to the reduction of switching activity of the carry-computation unit. In this paper by reformulating the carry equations, we i...
متن کاملDesign and Characterization of Fault Tolerant Power Parallel Prefix Adders using FPGA Design
Parallel-prefix adders (also known as carry tree adders) are known to have the best performance in VLSI designs. However, this performance advantage does not translate directly into FPGA implementations due to constraints on logic block configurations and routing overhead. This paper investigates three types of carry-tree adders (the Kogge-Stone, sparse Kogge-Stone, and spanning tree adder) and...
متن کاملNon-Heuristic Optimization and Synthesis of Parallel-Prefix Adders
The class of parallel-prefix adders comprises the most area-delay efficient adder architectures – such as the ripple-carry, the carry-increment, and the carry-lookahead adders – for the entire range of possible area-delay trade-offs. The generic description of these adders as prefix structures allows their simple and consistent area optimization and synthesis under given timing constraints, inc...
متن کاملA Family of Parallel-Prefix Modulo 2 − 1 Adders
In this paper we at first reveal the cyclic nature of idempotency in the case of modulo 2n − 1 addition. Then based on this property, we derive for each n, a family of minimum logic depth modulo 2n − 1 adders, which allows several trade-offs between the number of operators, the internal wire length, and the fanout of internal nodes. Performance data, gathered using static CMOS implementations, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Low Power Electronics and Applications
سال: 2021
ISSN: ['2079-9268']
DOI: https://doi.org/10.3390/jlpea11040045